Block Method for Convex Polygon Triangulation
نویسندگان
چکیده
In this paper, the block method for convex polygon triangulation is presented. The method is based on the usage of the previously generated triangulations for polygon with smaller number of vertices. In the beginning, we establish some relations between the triangulations of the polygons having the consecutive number of vertices. Using these relations, we decompose the triangulation problem into subproblems which are themselves smaller instances of the starting problem. The recursion with memoization is used to avoid repeating the calculation of results for previously processed inputs. The corresponding algorithm is developed and implemented.
منابع مشابه
An algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest area triangle in the triangulation. There exists a dynamic programming algorithm that computes ...
متن کاملAlgorithms for optimal area triangulations of a convex polygon
Given a convex polygon with n vertices in the plane, we are interested in triangulations of its interior, i.e., maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest triangle in the triangulation. Similarly, the MinMax area triangulation is the...
متن کاملUnited Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS A LINEAR TIME ALGORITHM FOR FINDING THE CONVEX ROPES BETWEEN TWO VERTICES OF A SIMPLE POLYGON WITHOUT TRIANGULATION
The convex rope problem, posed by Peshkin and Sanderson in IEEE J. Robotics Automat, 2 (1986) pp. 53-58, is to find the counterclockwise and clockwise convex ropes starting at the vertex a and ending at the vertex b of a simple polygon, where a is on the boundary of the convex hull of the polygon and b is visible from infinity. In this paper, we present a linear time algorithm for solving this ...
متن کاملThe Generation of Pseudo-Triangulated Spiral Polygon Using Convex Hull Layers
The generation of random simple polygon and the pseudo-triangulation of a polygon are regarded as the proposed problems in computational geometry. The production of a random polygon is used in the context of the consideration of the accuracy of algorithms. In this paper, a new algorithm is presented to generate a simple spiral polygon on a set of random points S in the plane using convex hull l...
متن کاملA pointed Delaunay pseudo-triangulation of a simple polygon
We present a definition of a pointed Delaunay pseudotriangulation of a simple polygon. We discuss why our definition is reasonable. Our approach will be motivated from maximal locally convex functions, and extends the work of Aichholzer et al.[1]. Connections between the polytope of the pointed pseudotriangulations and the Delaunay pseudo-triangulation will be given.
متن کامل